Method to increase the bit rate in a communications system

ABSTRACT

Disclosed is a method and a device to increase the bit rate in a communications system comprising N transmitters ( 2   N ) and M receivers ( 3   M ), with M greater than or equal to N. The method comprises the following steps.  
     a) simultaneously sending different messages on several of the N ( 2   N ) transmitters,  
     b) simultaneously receiving the superimposition of the messages sent during the step a) on several of the M ( 3   M ) receivers or reception sensors,  
     c) estimating the characteristics of the transmission channel for each pair constituted by a transmission sensor and a receiver sensor,  
     d) jointly estimating all or at least the majority of the messages received in taking account of the signals as well as the characteristics of the transmission channel.  
     Application to GSM signals and to systems of unicast transmission and multicast transmission, namely multipoint-to-point and multipoint-to-multipoint transmission.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention pertains more generally to the field of communications systems and, more particularly, to wireless communications, for examples cellular networks.

[0003] It can be applied to any communications system in which the structure of the data transmitted does not comprise any intrinsic system for differentiating between the different users if they are making simultaneous transmission (as is the case, for example with CDMA codes which are used to used to identify the different transmitters).

[0004] The system according to the invention can be applied more particularly to dedicated unicast or multicast communications (in which one point corresponds to a receiver or to a transmitter having one or more antennas).

[0005] 2. Description of the Prior Art

[0006] Most present-day communications systems generally make use of a single transmission antenna. Consequently, the capacity of the transmission channel or the maximum achievable bit rate for the data transmitted is fairly low.

[0007] There are also known ways of using spread-spectrum codes such as the CDMA (Code Division Multiple Access) to exploit the (channel) diversity of a communications system such as the UMTS (Universal Mobile Telecommunications System).

[0008] The U.S. Pat. No. 6,115,427 discloses a method and a system to augment the data bit rate in a transmission system and provide a diversity of antennas by using several transmit and receive antennas. This method relies mainly on a step for the space-time encoding of the data at transmission in order to differentiate between the different data streams and to detect them in conjunction.

[0009] The drawback of these methods, especially, is that their implementation leads to a modification of the transmission or communications systems, for example the modification of existing transmitters or receivers.

SUMMARY OF THE INVENTION

[0010] The present invention relies on a novel approach based on a joint processing of all the signals. This approach considers all the signals sent to be useful rather than estimating only one of them and considering the others to be noise for example. It can be applied to both unicast links and multicast links.

[0011] The method especially uses the diversity provided by the transmission channel, which is spatially sampled by a number of reception sensors greater than or equal to the number of transmission sensors and an adapted processor or computer.

[0012] In normal operation, the method does not make use of a spread-spectrum code associated with a user, which is the known approach in most of the prior art devices. It can be applied without distinction to multicast transmission as well as to unicast transmission.

[0013] The object of the invention pertains to a method to increase the bit rate in a communications system comprising N transmitters and M receivers or reception sensors, with M greater than or equal to N, the structure of the data transmitted having no intrinsic system to differentiate between the users. The method comprises at least the following steps.

[0014] a) simultaneously sending different messages on several of the N transmitters,

[0015] b) simultaneously receiving the superimposition of the messages sent during the step a) on several of the M reception sensors, with M greater than or equal to N,

[0016] c) estimating the characteristics of the transmission channel for each pair constituted by a transmission sensor and a receiver sensor,

[0017] d) jointly estimating all or at least the majority of the messages received in taking account of the signals as well as the characteristics of the transmission channel or channels.

[0018] The step d) is performed, for example, with a receiver adapted to the joint estimation of the reference sequences transmitted in the signal and the propagation channels.

[0019] For the step d), the method uses, for example, a linear filter minimizing the mean squared error between the output of the receiver and the real symbols of the signal received at the reception sensors or again a non-linear filter minimizing the mean squared error in taking account of a “feed forward” filtering function and a “feedback” filtering function and of the of the vector b_(n) of the symbols of the received signal.

[0020] The method can be applied to GSM signals comprising a reference sequence used for the step d).

[0021] The method is used, for example, for a same user simultaneously transmitting several different messages or for several users each transmitting its own message.

[0022] The object of the invention also relates to a device to increase the bit rate in a transmission system comprising several transmitters N and several receivers M, wherein the device comprises a device adapted to performing the steps of the method described here above.

[0023] The object of the invention especially has the following advantages:

[0024] It offers a transmission system that provides an increase in the bit rate and robustness of cellular type transmission, described for example in the ETSI standard for GSM communications systems.

[0025] It does not require space-time encoding in normal operation.

[0026] With slight modification of existing standards, it enables:

[0027] the multiplication by N of the bit rate of a BTS or node type transmission,

[0028] the multiplication by N of the bit rate of a cellular radiomobile type reception system,

[0029] an increase in robustness with respect to disturbances generated by the transmission channel.

[0030] It can be applied in confined types of transmission channels such as train tunnels or metropolitan underground rail transit tunnels, whatever the type of transmission medium, and can also be used in urban, mountainous and rural environments where the spatial diversity is sufficient to provide for high-quality transmission.

BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Other features and advantages shall appear from the following description, given by way of an illustration that in no way restricts the scope of the invention, and from the appended drawings, of which:

[0032]FIG. 1 shows an architecture of a transmission system according to the invention,

[0033]FIGS. 2A and 2B show the layout of co-localized and de-localized antennas,

[0034]FIG. 3 gives a view of the functions used to linearize the GMSK modulation,

[0035]FIG. 4 shows several comparative curves implementing the linear approximation and a standard demodulation,

[0036]FIG. 5 shows the structure of the standard DFE or decision feedback equalizer,

[0037]FIG. 6 shows two contexts of application of the method according to the invention,

[0038] FIGS. 7 to 10 show results obtained by implementing the method according to the invention.

MORE DETAILED DESCRIPTION

[0039] In order to provide for a clearer understanding of the method and system of transmission according to the invention, the following description is given by way of an illustration that in no way restricts the scope of the invention. The description pertains to a cellular type transmission system, such as the GSM system, in a multiple-user context. The structure of the data transmitted has the characteristic of not comprising an intrinsic system to differentiate between users, at least in normal operation.

[0040]FIG. 1 shows a block diagram of a GSM type communications system comprising a transmitter source 1 comprising N transmission antennas 2 _(N) and M reception antennas 3 _(M) connected to a receiver 4 and to a device such as a processor 5 provided with an algorithm adapted to the execution of the steps of the method according to the invention. The number M of antennas at reception is greater than or equal to the number N of antennas at transmission. If N users are present, they form the network of the N transmission antennas.

[0041] The object of the present invention relies especially on the fact that the networks of the M reception antennas and of the N transmission antennas associated with the characteristics of the transmission channel can be used especially to exploit the diversity needed to implement MIMO (Multiple Input Multiple Output) type antennas based on the decorrelation of the different channels for the detection of the data streams transmitted.

[0042] The N transmission antennas 2 _(N) preferably transmit several data streams corresponding to different messages. The signals are propagated between the source and the receiver along several paths. These are direct paths or multiple paths resulting from reflections on obstacles 5.

[0043] Two examples of the layout of the antennas at transmission and at reception are shown in FIGS. 2A and 2B.

[0044] According to one alternative embodiment (FIG. 2A), one and the same user can simultaneously transmit several different messages. This corresponds to transmission antennas 2 _(N) that are close to one another. In this case, the transmission antennas 2 _(N) and reception antennas 3 _(M) are kept at a sufficient distance from each other as compared with the spatial decorrelation distance, thus generating decorrelated propagation channels.

[0045] According to another alternative embodiment (FIG. 2B), each of the N users, for example, transmits his own message. This corresponds to a layout of delocalized antennas. The reception sensors 3 _(M) are sufficiently separated to ensure a decorrelation between the different propagation channels.

[0046] The idea of the invention is based especially on the joint processing of all the signals sent, in considering these signals to be useful signals, rather than in seeking to estimate one of them while considering the other signals to be noise.

[0047] The processor 5 linked with the reception antennas 3 _(M) is provided for example with an algorithm enabling an antenna of co-localized sensors to receive several messages coming from delocalized or co-localized transmission antennas, through an urban, mountainous or tunnel type propagation channel for example.

[0048] Various exemplary receivers are given here below in the description.

[0049] In short, the method according to the invention comprises especially the following steps:

[0050] a) Simultaneously transmitting different messages on the N transmission antennas 2 _(N)

[0051] b) Simultaneously receiving the different superimposed messages on M reception antennas 3 _(M),

[0052] c) Estimating the characteristics of the transmission channel with respect to each reception antenna,

[0053] d) jointly estimating all the messages received in taking account of the information from the sensors (signals received on the sensors) as well as the characteristics of the above-mentioned channel.

[0054] In normal operating conditions, the method does not use any intrinsic system to differentiate between users, as is done for example with the codes used at the CDMA level.

[0055] In normal operating conditions, the method does not require any space-time encoding at transmission.

[0056] The characteristics of the channel may be estimated according to a method known to those skilled in the art. For example, the estimation is carried out by using reference sequences included in the signals, such as the GSM “training sequence”.

[0057] The transmissions may be unicast or multicast (point-to-multipoint as well as multipoint-to-multipoint) communications.

[0058] Before providing a detailed description of the various possibilities of processing at reception, corresponding to the step d) of the method, a few points about the signals are recalled.

[0059] Model of the Signal

[0060] The signal received by the network of sensors is expressed in the case of a single transmission by the relationship (1)

x(t)=h(t,τ)*s(t)+n(t)  (1)

[0061] where

[0062] x(t) is the received signal,

[0063] h(t,τ) is the vector of the transmission channel having a dimension M, t being the time and τ the temporal spread,

[0064] s(t) is the transmitted GMSK (Gaussian Minimum Shift Keying) signal that does not comprise any identifier proper to a user,

[0065] n(t) is the noise vector, with a dimension N, assumed to be spatially and temporally Gaussian white noise having a covariance σ²I.

[0066] In the case of a multiple-transmission context for which the types of propagation give rise to a diversity of transmission and, therefore generate decorrelated propagation channels on an antenna with several sensors that are spatially distant from each other, the received signal is modeled by the following expression: ${x(t)} = {{\sum\limits_{u = 1}^{U}{\sum\limits_{p = 1}^{P}{{\alpha_{p}^{u}(t)}{s^{u}\left( {t - {\tau_{p}^{u}(t)}} \right)}}}} + {n(t)}}$

[0067] with:

[0068] s^(u)(t) the signal transmitted by the user,

[0069] α^(u) _(p)(t) the vector with a dimension N grouping the complex amplitudes of the path P for the signal u transmitted,

[0070] τ^(u) _(p) the propagation delay of the path P for the transmitted signal U,

[0071] P is the number of propagation paths, assumed to be equal for each transmitter,

[0072] U is the number of simultaneous transmissions.

[0073] Hereinafter in the description of a GSM context that does not restrict the scope of the invention, the complex amplitudes and the propagation delays shall be considered to be invariant over a period of time equivalent to one GSM burst, namely 0.5 ms. This is an example given in order to simply the notations, by way of an illustration that no way restricts the scope of the invention.

[0074] Linearization of the Modulation in the Example Given for the GSM

[0075] In the case of the non-restrictive application to the GSM system, the modulation used in transmission is of the GMSK (Gaussian Minimum Shift Keying) type. This modulation is a modulation using memorized symbols. The modulation is dependent on three symbols at each instant t.

[0076] The optimum demodulator in SGWN (standard Gaussian white noise) is implemented for example by a Viterbi decoder known to those skilled in the art. Owing to the number of possible phase states (0, π/2, π, 3π/2) and the number of memory symbols (c), the decoder comprises 16 states (3-1)⁴ to be examined for each bit received.

[0077] In order to simplify the problem induced by the memory symbol and related to the GMSK modulation, a simplification is obtained by means of an equivalent representation using a combination of linear modulations, described for example in the article by P. A. Laurent, “Exact and Approximate Construction of Digital Phase Modulations by Superposition of Amplitude Modulated Pulses (AMP)” in IEEE Trans. Communications, Vol. 34, pp. 150-60, 1986.

[0078] This linear combination can be expressed in the following form (3): $\begin{matrix} {{s(t)} = {\sum\limits_{n = {- \infty}}^{\infty}{j^{A_{a,n}}\left\lbrack {{C_{0}\left( {t - {nT}_{s}} \right)} + {j^{{- a},{n - 1}}C_{1}\left( {t - {nT}_{s}} \right)} +} \right.}}} \\ \left. {{j^{a,{n - 2}}{C_{2}\left( {t - {nT}_{s}} \right)}} + {j^{a,{n - 1 - a},{n - 2}}C_{3}\left( {t - {nT}_{s}} \right)}} \right\rbrack \end{matrix}$

[0079] with $A_{0,n} = {\sum\limits_{i = {- \infty}}^{n}a_{i}}$

[0080] The functions C₀(t), . . . , C₃(t) shown in FIG. 3 are obtained from the above-mentioned breakdown.

[0081] Given the small contribution of the coefficients C₀(t), . . . , C₃(t), the GMSK modulation is expressed according to the relationship (4): ${s(t)} = {\sum\limits_{n = 0}^{\infty}{j^{A_{0,n}}{C_{0}\left( {t - {nT}_{s}} \right)}}}$

[0082] the function C₀(t) being defined on 4 symbols.

[0083] In this case, the standard Gaussian white noise (SGWN) demodulation that meets the Nyquist criterion is obtained, for example, through a simple matched filter (MF), followed by a sampler working at the symbol rhythm and a decision-making operation.

[0084]FIG. 4 illustrates the low distortion introduced by the linear approximation method as compared with a classic GMSK demodulation using the Viterbi decoder. The curves (I), (II), (III) respectively correspond to the linear approximation method, the theoretical curves and an optimum Viterbi type demodulation. The x-axis corresponds to the ratio E_(b)/N₀ with E_(b) being the binary energy and N₀ being the spectral power density of the noise.

[0085] Model of the Signal in Multiple-User Transmission Mode

[0086] In the multiple-user context, the propagation or transmission channel is modeled as being specular. This representation is given by way of an illustration; it is in no way restrictive, and any other type of adaptive modeling may be used.

[0087] The model of the signal in this example is modified in order to take account of these new assumptions according to the following relationship (5): ${x(t)} = {{\sum\limits_{u = 1}^{U}{\sum\limits_{p = 1}^{P}{\alpha_{p}^{u}{s^{u}\left( {t - \tau_{p}^{u}} \right)}}}} + {n(t)}}$

[0088] After linear approximation, the signal received by the sensors is written as follows (6): ${x(t)} = {{\sum\limits_{u = 1}^{U}{\sum\limits_{p = 1}^{P}{\sum\limits_{n = 1}^{N_{a}}{\alpha_{p}^{u} \cdot j^{n} \cdot b_{n}^{u} \cdot {C_{0}\left( {t - {nT}_{s} - \tau_{p}^{u}} \right)}}}}} + {n(t)}}$

[0089] where N_(a) is the number of symbols sent.

[0090] After oversampling at the frequency Fe=1/T_(e) with T_(e)=T_(symbol)/K (K being the oversampling factor) the received signal becomes (7): ${x\left( {nT}_{e} \right)} = {{\sum\limits_{u = 1}^{U}{\sum\limits_{p = 1}^{P}{\alpha_{p}^{u}{\sum\limits_{n = 1}^{N_{a}}{j^{n} \cdot b_{n}^{u} \cdot {C_{0}\left( {{nT}_{e} - {nT}_{s} - \tau_{p}^{u}} \right)}}}}}} + {n\left( {nT}_{e} \right)}}$

[0091] with x(nT_(e)) having dimensions N*N_(e),

[0092] N is the number of sensors and Ne is the number of samples on the temporal section nT_(e) such that (8):

x=[x ^(T)(0), . . . x ^(T)((N _(e)−1)T _(e))]^(T)

[0093] where N_(e) is chosen to be equal to:

N _(a)(4·k+L−1)

[0094] with L as the length of the channel verifying (9)

0≦τ_(p) ^(u)≦(L−1)T _(e) ,∀u,p

[0095] The number 4 is related to the temporal duration expressed in symbols of the function C₀(t).

[0096] The matrix formulation of the signal x leads to (10):

x=Ha+n

[0097] where the vector a with a dimension N_(a)*U is written as follows: a = [a₁^(T), …, a_(N_(a))^(T)]^(T) with : a_(n) = j^(n) ⋅ [b_(n)¹, …, b_(n)^(U)]^(T)

[0098] The matrix H (N.N_(e)*N_(a)) represents the convolution of the impulse response of the channel that is oversampled by the function C₀(t)

{tilde over (H)}[C¹ . . . C^(U)]  (11)

[0099] or: $C^{u} = {\sum\limits_{p = 1}^{P}\begin{bmatrix} O_{\tau_{p}^{u}} \\ c_{\tau_{p}^{u}} \\ {\overset{\_}{O}}_{\tau_{p}^{u}} \end{bmatrix}}$ with : c  τ_(p)^(u) = [C₀(lT_(e) − τ_(p)^(u)), …, C₀((l + 4 ⋅ k)T_(e) − τ_(p)^(u))]^(T) ⊗ α_(p)^(u)

$l = {\arg {\min\limits_{l}\left\lfloor \frac{\tau_{p}^{u}}{{lT}_{e}} \right\rfloor}}$

[0100]

is the Kronecker product.

[0101] This model is used in remaining part of the method according to the invention.

[0102] Detailed Explanation of the Processing step d) at Reception

[0103] The method and the system according to the invention use an algorithm for the reception of several signals on an antenna of co-localized sensors of several messages coming from delocalized or co-localized transmission antennas and through an urban, mountainous or tunnel type of propagation channel for example.

[0104] The following description gives three exemplary receivers used to execute especially the step d).

[0105] Optimal Receivers

[0106] An optimal receiver jointly estimates the transmitted sequences and the propagation channels. These receivers nevertheless have the drawback of becoming rapidly complex.

[0107] Various types of equalizers may be chosen such as the MF (Matched Filter), DFE ZF (Decision Feedback Equalizer-Zero Forcing filter) and the DFE MMSE (Decision Feedback-Minimum Mean Squared Error filter).

[0108] The results obtained in simulations have shown that only the linear MMSE sub-optimal receivers as well as the non-linear DFE-MMSE type equalizers perform best in terms of residual bit error rate (BER).

[0109] Linear Sub-Optimal MMSE Receivers

[0110] After the matched filter H, which may or may not be a whitening filter, is applied to the received signals x, we obtain

y=H ^(H) x  (12)

[0111] In the application to the GSM context, the MMSE detector is a filter applied to the output of the MF minimizing the mean squared error between the output of the receiver and the real symbols such that (13): $E\left\lbrack {{{M_{MMSE} \cdot \begin{bmatrix} y \\ y^{\dagger} \end{bmatrix}} - a}}^{2} \right\rbrack$

[0112] a is defined by e_(i)=[0,0, . . . 0,1,0, . . . , 0,] with the 1 in position i

[0113] the minimization step leads to the expression (14): ${E\left\lbrack {{e_{j}^{T} \cdot \begin{bmatrix} y \\ y^{*} \end{bmatrix} \cdot \left\lbrack {y^{\dagger}y^{T}} \right\rbrack \cdot M_{MMSE}^{\dagger}}e_{i}} \right\rbrack} = {E\left\lbrack {e_{j}^{T} \cdot \begin{bmatrix} y \\ y^{*} \end{bmatrix} \cdot a^{\dagger} \cdot e_{i}} \right\rbrack}$

[0114] with:

E[yy ^(†) ]={overscore (H)}{overscore (H)} ^(†)+σ² {overscore (H)}

E[yy ^(T) ]={overscore (H)}Ĩ{overscore (H)} ^(T)

[0115] the criterion becomes: $\begin{matrix} {{\left\lbrack {\begin{bmatrix} {\overset{\_}{H}{\overset{\_}{H}}^{\dagger}} & {\overset{\_}{H}\overset{\sim}{I}{\overset{\_}{H}}^{T}} \\ {{\overset{\_}{H}}^{*}\overset{\sim}{I}{\overset{\_}{H}}^{\dagger}} & {{\overset{\_}{H}}^{\star}{\overset{\_}{H}}^{T}} \end{bmatrix} + {\sigma^{2}\begin{bmatrix} \overset{\_}{H} & 0 \\ 0 & {\overset{\_}{H}}^{*} \end{bmatrix}}} \right\rbrack \cdot M_{MMSE}^{\dagger}} = \begin{bmatrix} {\overset{\_}{H}I} \\ {{\overset{\_}{H}}^{*}\overset{\sim}{I}} \end{bmatrix}} & (15) \end{matrix}$

[0116] Giving the relationship (16): $M_{MMSE}^{\dagger} = {\begin{bmatrix} {{H_{n}H_{n}^{\dagger}} + {\sigma^{2}H_{n}}} & {H_{n}{\overset{\sim}{I}}_{n}H_{n}^{T}} \\ {H_{n}^{*}{\overset{\sim}{I}}_{n}H_{n}^{\dagger}} & {{H_{n}^{*}H_{n}^{T}} + {\sigma^{2}H_{n}}} \end{bmatrix}^{\#} \cdot \begin{bmatrix} {H_{n}I_{7}} \\ {H_{n}I_{8}} \end{bmatrix}}$

[0117] where # corresponds to the pseudo-inverse value.

[0118] This linear receiver is optimal, with respect to its criterion, on the blocks (or slots) of the GSM transmission and takes account of the fine structure of the FDD/TDMA (Frequency Division Duplex/Time Division Multiple Access) frames.

[0119] Non-Linear Sub-Optimal MMSE Receiver

[0120] They have the advantage of minimizing the size of the matrix inversions.

[0121] The structure of a standard DFE equalizer is defined in FIG. 5

[0122] The filtering function G is commonly called a “Feed Forward” function and the function B is called a “Feedback” function.

[0123] Two types of DFE equalizers may be considered: the ZF (Zero Forcing) equalizer and the MMSE (Minimum Mean Square Error) equalizer.

[0124] It is recalled that the ZF type equalizers do not take the presence of noise into account. This limits the performance obtained for them for low signal-to-noise ratios.

[0125] Consequently, only the MMSE Equalizer is described in the following method.

[0126] The optimization criterion minimizing the mean squared error at output of the equalizer is written as follows (17): $E\left\lbrack {{{\left\lbrack {G - B} \right\rbrack \begin{bmatrix} y_{n} \\ y_{n}^{*} \\ d_{n} \\ d_{n}^{*} \end{bmatrix}} - b_{n}}}^{2} \right\rbrack$

[0127] where: $\begin{matrix} {y_{n} = \left\lbrack {{\overset{\_}{y}}_{n - L_{G}}^{T}\quad \cdots \quad {\overset{\_}{y}}_{n}^{T}\quad \cdots \quad {\overset{\_}{y}}_{n + L_{G}}^{T}} \right\rbrack^{T}} \\ {y = \left\lbrack {{\overset{\_}{y}}_{1}^{T}\quad \cdots \quad {\overset{\_}{y}}_{N_{a}}^{T}} \right\rbrack^{T}} \end{matrix}$

[0128] and: b_(n) = [a_(n − L_(G))^(T)  ⋯  a_(n)^(T)  ⋯  a_(n + L_(G))^(T)]^(T)

[0129] represents a vector of symbols

[0130] and: d_(n) = [a_(n − L_(B))^(T)  ⋯  a_(n − 1)^(T)]^(T)

[0131] The matrix H_(n) contains the impulse response corresponding to the observation y_(n):

y _(n) =H _(n) b _(n) +n _(n)

[0132] with n_(n) being the correlated noise vector corresponding to the observation y_(n). The filters G and B are obtained according to the following relationships (18): $\begin{bmatrix} G_{{DFE} - {MMSE}}^{\dagger} \\ {- B_{{DFE} - {MMSE}}^{\dagger}} \end{bmatrix} = {\begin{bmatrix} {{H_{n}H_{n}^{\dagger}} + {\sigma^{2}H_{n}}} & {H_{n}{\overset{˘}{I}}_{n}H_{n}^{T}} & {H_{n}I_{3}} & {H_{n}I_{4}} \\ {H_{n}^{*}{\overset{˘}{I}}_{n}H_{n}^{7}} & {{H_{n}^{*}H_{n}^{T}} + {\sigma^{2}H_{n}}} & {H_{n}^{*}I_{4}} & {H_{n}^{*}I_{3}} \\ {I_{3}^{T}H_{n}^{\dagger}} & {I_{4}^{T}H_{n}^{T}} & I_{5} & I_{6} \\ {I_{1}^{T}H_{n}^{7}} & {I_{3}^{T}H_{n}^{T}} & I_{6} & I_{5} \end{bmatrix}^{\pounds}.\begin{bmatrix} {H_{n}I_{7}} \\ {H_{n}I_{8}} \\ 0 \\ 0 \end{bmatrix}}$

[0133] The length of the filter B is equal to LB and that of the filter G is equal to 2 (2LG+1)

[0134] With: $\begin{matrix} {{\overset{\sim}{I}}_{n} = {E\left\lbrack {b_{n}^{*}b_{n}^{\dagger}} \right\rbrack}} \\ {I_{3} = {E\left\lbrack {b_{n}d_{n}^{\dagger}} \right\rbrack}} \\ {I_{4} = {E\left\lbrack {b_{n}d_{n}^{T}} \right\rbrack}} \\ {I_{5} = {E\left\lbrack {d_{n}d_{n}^{\dagger}} \right\rbrack}} \\ {I_{6} = {E\left\lbrack {d_{n}^{*}d_{n}^{\dagger}} \right\rbrack}} \\ {I_{7} = {E\left\lbrack {b_{n}a_{n}^{\dagger}} \right\rbrack}} \\ {I_{8} = {E\left\lbrack {b_{n}^{*}a_{n}^{\dagger}} \right\rbrack}} \end{matrix}$

[0135] The method described here above can be applied especially well in the context of urban or mountainous environments, or again for metropolitan underground rail transit or railway tunnels as shown diagrammatically in FIG. 6.

[0136] The former case gives rise to a multiple-path context that generates a sum of several correlated and delayed signals. The latter case is categorized chiefly by a major attenuation in the first decameters traveled and a sum of different parts giving rise, at the reception sensors, to a major space-time correlation. The two types of propagation generate a diversity of transmission. They therefore generate decorrelated propagation channels on an antenna with several sensors spatially distant from each other.

[0137] Urban, mountainous or tunnel type propagation induces multiple paths converging toward the concerned receiver. Consequently, a Doppler spread is generated by randomly modifying the complex characteristics of the signal received by each of the sensors and thus creating propagation diversity.

[0138] FIGS. 7 to 11 represent results obtained by implementing the method according to the invention.

[0139] The performance characteristics of the block equalizers and non-block equalizers are presented and compared. The values of the filters computed depend on the chosen length of the transverse filter.

[0140] Model of the Transmission Channel

[0141]FIG. 7 represents the frequency response of the transmission channel.

[0142] The results have been obtained for a channel with the following characteristics:

[0143] 4 paths in a channel

[0144] τ=[1, 14, 17, 11]

[0145] complex amplitudes of the paths:

[0146] α=[−0.6632+0.0188i, 0.0622−0.0549i, −0.3343+0.2573, i0.1366−0.6557i]

[0147] symbol oversampling factor: 4

[0148] Results Obtained in the Case of Multiple Sending, Multiple Reception and Multiple Paths

[0149] Two transmission scenarios are considered here:

[0150] 1. MIMO unicast transmission

[0151] 2. MIMO multicast transmission

[0152] In the first case, the transmitters are separated by a distance greater than the correlation distance of the channel considered. In this case, the profile of the channel is the same for all the paths (DOA and induced delays). This is a classic case in tunnel type propagation.

[0153]FIG. 9 shows the performance obtained in the case of two delocalized transmission operations, three reception sensors, two paths per channel and non-block receivers.

[0154] The DFE-MMSE (Decision Feedback Equalizer-Zero Forcing) system offers the best performance and is not excessively sensitive to inter-symbol interference (ISI) introduced by the second path.

[0155] In the second case, the propagation channels are totally decorrelated (outdoor transmission). This makes it possible especially to validate the feasibility of transmission in the context of a metropolitan underground rail transit tunnel in a ratio of 4 with respect to standard GSM transmission. The performance obtained in this type of scenario is shown in FIG. 10 whose notations are identical to those of FIG. 9, taken by way of an example.

[0156] The conditions are the following: 4 transmission operations, 5 reception sensors, one path per channel with the same delay and one non-block receiver.

[0157] The figure shows that the performance is better than in the case of FIG. 9. This is related to the fact that the capacity of the transmission channel increases when the number of transmission and reception antennas increases.

[0158] The above results are obtained without any error correction system and give error rates of to 10⁻³ to 10⁻⁴ for signal-to-noise (S/N) ratios of over 5 dB. 

What is claimed is:
 1. A method to increase the bit rate in a communications system comprising N transmitters and M receivers, with M greater than or equal to N, the structure of the data exchanged comprising no intrinsic system to differentiate between different users, wherein the method comprises at least the following steps. a) simultaneously sending different messages on several of the N transmitters, b) simultaneously receiving the superimposition of the messages sent during the step a) on several of the M receivers or reception sensors, c) estimating the characteristics of the transmission channel for each pair constituted by a transmission sensor and a receiver sensor, d) jointly estimating all or at least the majority of the messages received in taking account of the signals as well as the characteristics of the transmission channel or channels.
 2. A method according to claim 1, wherein the step d) is performed, for example, with a receiver adapted to the joint estimation of the reference sequences transmitted in the signal and the propagation channels.
 3. A method according to claim 2, wherein the step d) uses a linear filter minimizing the mean squared error between the output of the receiver and the real symbols of the signal received at the reception sensors
 4. A method according to claim 2, wherein the step d) uses a non-linear filter minimizing the mean squared error in taking account of a “feed forward” filtering function and a “feedback” filtering function and of the vector bn of the symbols of the received signal.
 5. A method according to one of the claims 1 to 4, wherein the signals are GSM signals comprising a reference sequence used for the step d).
 6. A use of a method according to one of the claims 1 to 5 for a same user simultaneously transmitting several different messages or for several users each transmitting his own message.
 7. A system to increase the bit rate in a transmission system comprising a number of transmitters N and a number of receivers M, the system comprising a device adapted to performing the steps of the claims 1 to
 6. 8. A system according to claim 7, wherein the number M is greater than or equal to N.
 9. An application of the method according to one of the claims 1 to 6 or of the system according to one of the claims 7 to 8 in systems of unicast transmission and multicast transmission, namely multipoint-to-point and multipoint-to-multipoint transmission. 